MIP reformulations of the probabilistic set covering problem
نویسندگان
چکیده
منابع مشابه
MIP reformulations of the probabilistic set covering problem
In this paper, we address the following probabilistic version (PSC) of the set covering problem:min{cx |P(Ax ≥ ξ) ≥ p, x ∈ {0, 1}N }where A is a 0-1matrix, ξ is a random 0-1 vector and p ∈ (0, 1] is the threshold probability level. We introduce the concepts of p-inefficiency and polarity cuts. While the former is aimed at deriving an equivalentMIP reformulation of (PSC), the latter is used as a...
متن کاملA Short Note on the Probabilistic Set Covering Problem
In this paper we address the following probabilistic version (PSC) of the set covering problem: min{cx | P(Ax ≥ ξ) ≥ p, xj ∈ {0, 1} j ∈ N} where A is a 0-1 matrix, ξ is a random 0-1 vector and p ∈ (0, 1] is the threshold probability level. In a recent development Saxena, Goyal and Lejeune proposed a MIP reformulation of (PSC) and reported extensive computational results with small and medium si...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملProbabilistic Set Covering with Correlations
We consider a probabilistic set covering problem where there is uncertainty regarding whether a selected set can cover an item, and the objective is to determine a minimum-cost combination of sets so that each item is covered with a pre-specified probability. To date, literature on this problem has focused on the special case in which uncertainties are independent. In this paper, we formulate c...
متن کامل2 Set Covering Problem
In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-008-0224-y